Numerical relaxation limit and outgoing edges in a central scheme for networked conservation laws

A recently introduced scheme for networked conservation laws is analyzed in various experiments. The makes use of a novel relaxation approach that governs the coupling conditions network and does not require solution Riemann problem at nodes. We numerically compare dynamics obtained by to solutions using classical condition. In particular, we investigate case two outgoing edges Lighthill–Whitham–Richards model traffic flow Buckley–Leverett phase flow. Moreover, study asymptotic preserving property comparing it its preliminary form before limit 1-to-1 network.